Stability radii of symplectic and Hamiltonian matrices
نویسنده
چکیده
We review the Krein-Gel'fand-Lidskii theory of strong stability of Hamiltonian and symplectic matrices in order to nd a quantitative measure of the strong stability. As a result, formulas for the 2-norm distance from a strongly stable Hamiltonian or symplectic matrix to the set of unstable matrices are derived. 1 Deenition and simple properties of symplectic and Hamiltonian matrices Throughout the paper the superscript denotes the hermitian conjugation, and I is the identity matrix. The Krein-Gel'fand-Lidskii theory ((4], Chapter 3), which is main tool in study of stability of symplectic and Hamiltonian matrices, is valid for general G-unitary and G-Hamiltonian matrices. Let G 2 C nn be a nonsingular hermitian matrix (i.e. det G 6 = 0, G = G) which is neither positive nor negative deenite. In applications the matrix G often equals iJ, where i is the imaginary unit and J = 0 ?I k I k 0 !. Together with the standard scalar product (x; y) we deene a new, indeenite scalar product < x; y >= (Gx; y). Note that the number < x; x > is real but unlike (x; x) it need not be positive, hence the term indeenite. Given a matrix A 2 C nn , the matrix A G deened by < Ax; y >=< x; A G y > (x, y are arbitrary vectors in C nn) is said to be G-adjoint to A.
منابع مشابه
Symplectic and symmetric methods for the numerical solution of some mathematical models of celestial objects
In the last years, the theory of numerical methods for system of non-stiff and stiff ordinary differential equations has reached a certain maturity. So, there are many excellent codes which are based on Runge–Kutta methods, linear multistep methods, Obreshkov methods, hybrid methods or general linear methods. Although these methods have good accuracy and desirable stability properties such as A...
متن کاملSymplectic Matrices and Strong Stability of Hamiltonian Systems with Periodic Coefficients
A theory of the analysis of strong stability of Hamiltonian systems with periodic coefficients is presented. It is based on the strong stability of fundamental solution evaluated at its period. However, the matrix solution being symplectic, this analysis leads to the search of strong stability of a symplectic matrix. A method for the determination of the monodromy matrix is given and an applica...
متن کاملFortran 77 Subroutines for Computing the Eigenvalues of Hamiltonian Matrices II
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal symplectic decompositions, implying numerical backward stability as well as symmetry preservation for the computed eigenvalues. These algorithms are supplemented with balancing and block algorithms, which...
متن کاملStability Radii of Linear Discrete{time Systems and Symplectic Pencils
In this paper, we introduce and analyze robustness measures for the stability of discrete-time systems x(t+1) = Ax(t) under parameter perturbations of the form A ! A + BDC where B; C are given matrices. In particular we characterize the stability radius of the uncertain system x(t+1) = (A+BDC)x(t), D an unknown complex perturbation matrix, via an associated symplectic pencil and present an algo...
متن کاملAn SVD-Like Matrix Decomposition and Its Applications
A matrix S ∈ C2m×2m is symplectic if SJS∗ = J , where J = [ 0 −Im Im 0 ] . Symplectic matrices play an important role in the analysis and numerical solution of matrix problems involving the indefinite inner product x∗(iJ)y. In this paper we provide several matrix factorizations related to symplectic matrices. We introduce a singular value-like decomposition B = QDS−1 for any real matrix B ∈ Rn×...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998